Repeated-root constacyclic codes of length slmpn
نویسندگان
چکیده
For any different odd primes ` and p, structure of constacyclic codes of length 2`p over the finite field Fq of characteritic p and their duals is established in term of their generator polynomials. Among other results, the characterization and enumeration of all linear complimentary dual and self-dual constacylic codes of length 2`p are obtained.
منابع مشابه
On Repeated-Root Constacyclic Codes of Length $2^amp^r$ over Finite Fields
In this paper we investigate the structure of repeated root constacyclic codes of length 2mp over Fps with a ≥ 1 and (m, p) = 1. We characterize the codes in terms of their generator polynomials. This provides simple conditions on the existence of self-dual negacyclic codes. Further, we gave cases where the constacyclic codes are equivalent to cyclic codes.
متن کاملRepeated-root constacyclic codes of length $2\ell^mp^n$
For any different odd primes l and p, structure of constacyclic codes of length 2lp over a finite field Fq of characteritic p and their duals is established in term of their generator polynomials. Among other results, all linear complimentary dual and self-dual constacyclic codes of length 2lp over Fq are obtained.
متن کاملRepeated Root Constacyclic Codes of Length $mp^s$ over $\mathbb{F}_{p^r}+u \mathbb{F}_{p^r}+...+ u^{e-1}\mathbb{F}_{p^r}$
We give the structure of λ-constacyclic codes of length pm over R = Fpr +uFpr + . . .+uFpr with λ ∈ F ∗ pr . We also give the structure of λ-constacyclic codes of length pm with λ = α1 + uα2 + . . .+ u αe−1, where α1, α2 6= 0 and study the self-duality of these codes.
متن کاملTwo generalizations on the minimum Hamming distance of repeated-root constacyclic codes
We study constacyclic codes, of length np and 2np, that are generated by the polynomials (x+γ) and (x−ξ)(x+ξ) respectively, where x+γ, x−ξ and x+ξ are irreducible over the alphabet Fpa . We generalize the results of [5], [6] and [7] by computing the minimum Hamming distance of these codes. As a particular case, we determine the minimum Hamming distance of cyclic and negacyclic codes, of length ...
متن کاملMatrix-product structure of repeated-root constacyclic codes over finite fields
For any prime number p, positive integers m, k, n satisfying gcd(p, n) = 1 and λ0 ∈ F × pm, we prove that any λ p 0 -constacyclic code of length p n over the finite field Fpm is monomially equivalent to a matrix-product code of a nested sequence of p λ0-constacyclic codes with length n over Fpm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Finite Fields and Their Applications
دوره 33 شماره
صفحات -
تاریخ انتشار 2015